de_util ~master (2021-10-26T20:15:40.7960244)

breadth_first_search

devisualization util algorithms pathfinding breadthfirst

Locates the next node in graph to get to a position

  1. T[T] breadth_first_search(Graph graph, T start)
  2. T[T] breadth_first_search(Graph graph, T start, T goal)
    deprecated
    T[T]
    breadth_first_search
    (
    T
    )
    (
    Graph graph
    ,
    T start
    ,
    T goal
    )
  3. void breadth_first_search(Graph graph, T start, T goal, T[T] came_from, U[T] distance)

Parameters

graph Graph

The graph of nodes

start T

Starting position to go to

goal T

The end position

Return Value

Type: T[T]

An AA mapping a position to another to get to a point

Meta

Source

See Implementation

devisualization util algorithms pathfinding breadthfirst functions

Page generated by adrdox